Interpolants Induced by Marching Cases
نویسندگان
چکیده
Visualization depends among other things on the interpolant used in generating images. One way to assess this is to construct case tables for Marching Cubes that represent the chosen interpolant accuracy. Instead, we show how to construct the interpolants induced by Marching Cases for comparison and assessment, how to extend this approach to Marching Squares, Cubes and Hypercubes, and how to construct an interpolant which is computationally equivalent to the digital rules conventionally used in image processing. Furthermore, we demonstrate that unlike tetrahedral meshes, geometric measurements over multi-linear mesh cells are inherently non-linear and cannot be summed as in the Contour Spectrum. 1998 ACM Subject Classification G.1.1, I.3.5
منابع مشابه
(No) More Marching Cubes
Isosurfaces, one of the most fundamental volumetric visualization tools, are commonly rendered using the wellknown Marching Cubes cases that approximate contours of trilinearly-interpolated scalar fields. While a complete set of cases has recently been published by Nielson, the formal proof that these cases are the only ones possible and that they are topologically correct is difficult to follo...
متن کاملORTHOGONAL ZERO INTERPOLANTS AND APPLICATIONS
Orthogonal zero interpolants (OZI) are polynomials which interpolate the “zero-function” at a finite number of pre-assigned nodes and satisfy orthogonality condition. OZI’s can be constructed by the 3-term recurrence relation. These interpolants are found useful in the solution of constrained approximation problems and in the structure of Gauss-type quadrature rules. We present some theoretical...
متن کاملPeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification
Propositional interpolation is widely used as a means of overapproximation to achieve efficient SAT-based symbolic model checking. Different verification applications exploit interpolants for different purposes; it is unlikely that a single interpolation procedure could provide interpolants fit for all cases. This paper describes the PeRIPLO framework, an interpolating SAT-solver that implement...
متن کاملForgetting and Uniform Interpolation for ALC-Ontologies with ABoxes
We present a method to compute uniform interpolants of ALC-ontologies with ABoxes. Uniform interpolants are restricted views of ontologies that only use a specified set of symbols, but share all entailments in that signature with the original ontology. This way, it allows to select or remove information from an ontology based on a signature, which has applications in privacy, ontology analysis ...
متن کاملPractical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical Difference
We develop a clausal resolution-based approach for computing uniform interpolants of TBoxes formulated in the description logic ALC when such uniform interpolants exist. We also present an experimental evaluation of our approach and of its application to the logical difference problem for real-life ALC ontologies. Our results indicate that in many practical cases uniform interpolants exist and ...
متن کامل